Computer Science Technical Reports Structweb: Biosequence Structure Searching on the Web Using Clp(fd) Structweb: Biosequence Structure Searching on the Web Using Clp(fd)
نویسندگان
چکیده
We describe an implementation in a nite domain constraint logic programming language of a web-based biosequence structure searching program. We have used the clp(FD) language for the implementation of our search engine and have ported the PiLLoW libraries to clp(FD). Our program is based on CBSDL, a constraint based structure description language for biosequences, and uses constrained descriptions to search for the secondary structure of biosequences, such as tandem repeats, stem loops, palindromes and pseudo-knots.
منابع مشابه
A constraint{based system for protein motif{searching, pattern discovery and structure comparison
We describe the design and testing of a constraint{based system for searching protein databases, pattern discovery and protein structure comparison. The approach is based on the TOPS topological representation of protein structure, using the formal version of the TOPS language we have made, and incorporates constraints over nite domains. Searching is achieved using an eecient constraint{based a...
متن کاملBioSCAN: a network sharable computational resource for searching biosequence databases
We describe a network sharable, interactive computational tool for rapid and sensitive search and analysis of biomolecular sequence databases such as GenBank, GenPept, Protein Identification Resource, and SWISS-PROT. The resource is accessible via the World Wide Web using popular client software such as Mosaic and Netscape. The client software is freely available on a number of computing platfo...
متن کاملCorrectness Considerations in CLP(FD) Systems
Constraint logic programming (CLP) is a declarative formalism for describing conditions a solution must satisfy. Constraint logic programming over finite domains, denoted as CLP(FD), considers problems involving integers, including combinatorial problems such as planning, scheduling and allocation tasks. Given a problem description, a constraint solver tries to find valid solutions via constrai...
متن کاملProgramming with TOY(FD)
In [1] we presented the language T OY(FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that T OY(FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP (FD) ) as it integrates FD constraint solving, lazy evaluation, higher order applicatio...
متن کاملUsing Secondary Structure Information for Protein Folding in CLP(FD)
The protein folding problem is the problem of predicting the 3D structure of a protein when the linear sequence of aminoacids identifying it is known. In this paper we present a declarative implementation in Constrain & Generate style in CLP (FD) of the protein folding problem, for models based on face-centered cubes. We use information concerning secondary structure (and other heuristics) to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997